منابع مشابه
Dynamic Range Majority Data Structures
Given a set P of n coloured points on the real line, we study the problem of answering range α-majority (or “heavy hitter”) queries on P . More specifically, for a query range Q, we want to return each colour that is assigned to more than an α-fraction of the points contained in Q. We present a new data structure for answering range α-majority queries on a dynamic set of points, where α ∈ (0, 1...
متن کاملVersioning Tree Structures by Path-Merging
We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent versions in contrast to only one operation in the original variant. The superiority of the method is shown both theoretically and experimentally. Details of the technique are explained for the case of binary search tr...
متن کاملBeyond Logical Tree Structures for Data Replication Schemes beyond Logical Tree Structures for Data Replication Schemes
General Structured Voting is a general framework for a wide range of data replication and distributed mutual exclusion schemes. It allows an easy tailoring for speciic objects and environments in a homogeneous manner. In this paper we investigate the characteristics of a so-called voting structure used by General Structured Voting to derive sets of cooperating nodes. Such a set of cooperating n...
متن کاملSuccinct Data Structures for Path Queries
Consider a tree T on n nodes, each having a weight drawn from [1..σ]. In this paper, we design succinct data structures to encode T using nH(WT ) + o(n lg σ) bits of space, such that we can support path counting queries in O( lg σ lg lgn + 1) time, path reporting queries in O((occ+1)( lg σ lg lgn +1)) time, and path median and path selection queries in O( lg σ lg lg σ ) time, where H(WT ) is th...
متن کاملData replication in static tree structures
right Replication of data can lead to better performance due to increased availability of data. This paper explores the use of data replication for large, static data sets organized in a tree structure. In static environments, data replication does not have to deal with problems arising from maintaining consistency among copies [1,10,12]. Static data sets arise, for example, when updates on the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2020
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2020.05.039